3-D Parallel Exact Signed Euclidean Distance Transform
نویسندگان
چکیده
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce a three-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n voxels and p threads. Through this parallelization and efficient use of data structures we obtain approximately 3 times mean speedup on standard tests on a 4-processor machine compared with the current ITK exact Euclidean distance transform filter[4].
منابع مشابه
Parallel N-Dimensional Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce an N-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n voxels...
متن کاملOptimal Parallel Algorithms for the 3D Euclidean Distance Transform on the CRCW and EREW PRAM Models
In this paper, we develop parallel algorithms for the three-dimensional Euclidean distance transform (3D EDT) on both the CRCW and EREW PRAM computation models. Based on the dimensionality reduction technique and the solution for proximate points problem, we achieve the optimality of the 3D EDT computation. For an N × N × N binary image array, our parallel algorithms for 3D EDT computation are ...
متن کاملA High Performance 3D Exact Euclidean Distance Transform Algorithm for Distributed Computing
The Euclidean distance transform (EDT) is used in various methods in pattern recognition, computer vision, image analysis, physics, applied mathematics and robotics. Until now, several sequential EDT algorithms have been described in the literature, however they are timeand memory-consuming for images with large resolutions. Therefore, parallel implementations of the EDT are required specially ...
متن کاملSphere tracing and all that
1 Distance Fields Given an implicit surface ∂S with S ⊆ R the corresponding distance field (also called signed distance function) D : R → R which maps a point p from the domain of the distance field R to a real-valued distance value is obtained by distance transforming the surface using the formula D(p) = sign(p) ·min{d(p, q) : q ∈ S} (1) The metric d(p, q) used is the standard Euclidean metric...
متن کاملNew sequential exact Euclidean distance transform algorithms based on convex analysis
We present several sequential exact Euclidean distance transform algorithms. The algorithms are based on fundamental transforms of convex analysis: The Legendre Conjugate or Legendre–Fenchel transform, and the Moreau envelope or Moreau-Yosida approximate. They combine the separability of the Euclidean distance with convex properties to achieve an optimal linear-time complexity. We compare them ...
متن کامل